Stabilisation of Discrete Adjoint Solvers through Improved Primal Timestepping
نویسنده
چکیده
One major challenge in applying the adjoint method to large industrial cases is the lack of robustness of the flow and adjoint solvers. Discrete adjoints transpose the Jacobian of the system of discretised equations exactly, and hence inherit the linear stability from the primal flow solver. Typically the linear stability properties of the iterative scheme of the flow solver is very well understood, hence this is an attractive property. When the flow solver does not converge fully due to either numerical or physical instabilities, the discrete adjoint is bound to diverge and force the gradient-based optimisation to stop prematurely.
منابع مشابه
A Discrete Adjoint Version of an Unsteady Incompressible Solver for Openfoam Using Algorithmic Differentiation
The comparatively low computational costs of adjoint based gradient methods for optimization problems with a high number of degrees of freedom have allowed them to become one of the most interesting approaches in CFD shape optimization. At the core of such optimization techniques lies the computation of topology sensitivity maps. The two most common approaches for computing adjoint based sensit...
متن کاملDeriving Linear and Adjoint Codes for CFD using Automatic Differentiation
Sensitivity analysis is a research area of increasing interest within CFD. Recent developments in Automatic Differentiation software (AD) make the discrete adjoint methods particularly attractive. We outline the theory of adjoint sensitivities and discuss how to use AD to derive adjoint versions from CFD codes. In particular we review the properties of the four major AD packages, we explain how...
متن کاملA Non-Intrusive Parallel-in-Time Adjoint Solver with the XBraid Library
In this paper, an adjoint solver for the multigrid in time software library XBraid [56] is presented. XBraid provides a non-intrusive approach for simulating unsteady dynamics on multiple processors while parallelizing not only in space but also in the time domain. It applies an iterative multigrid reduction in time algorithm to existing spatially parallel classical time propagators and compute...
متن کاملGeometry Optimization in Three-Dimensional Unsteady Flow Problems using the Discrete Adjoint
The unsteady discrete adjoint equations are utilized to construct objective function gradients for use in geometry optimization in large scale three-dimensional unsteady ow problems. An existing massively parallel unstructured Reynolds-averaged Navier-Stokes equations solver forms the basis for the framework used to solve both the primal and dual (adjoint) problems. The framework is also capabl...
متن کاملLarge-Scale Three-Dimensional Acoustic Horn Optimization
Abstract. We consider techniques that enable large-scale gradient-based shape optimization of wave-guiding devices in the context of 3D time-domain simulations. The approach relies on a memory efficient boundary representation of the shape gradient together with primal and adjoint solvers semi-automatically generated by the FEniCS framework. The hyperbolic character of the governing linear wave...
متن کامل